Programing implementation of the Quine-McCluskey method for minimization of Boolean expression

نویسنده

  • Jiangbo Huang
چکیده

A Boolean function is a function that produces a Boolean value output by logical calculation of Boolean inputs. It plays key roles in programing algorithms and design of circuits. Minimization of Boolean function is able to optimize the algorithms and circuits. Quine-McCluskey (QM) method is one of the most powerful techniques to simplify Boolean expressions. Compared to other techniques, QM method is more executable and can handle more variables. In addition, QM method is easier to be implemented in computer programs, which makes it an efficient technique. There are several versions of QM simulation codes online, whereas some of them appear to have limitations of variables numbers or lack the consideration of Don’t-Care conditions. Here a QM simulation code based on C programing is introduced. Theoretically it is able to handle any number of variables and has taken the Don’tCare conditions into account.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified Quine-McCluskey Method

The digital gates are basic electronic component of any digital circuit. Digital circuit should be simplified in order to reduce its cost by reducing number of digital gates required to implement it. To achieve this, we use Boolean expression that helps in obtaining minimum number of terms and does not contain any redundant pair. Karnaugh map (K-map) and Quine-McCluskey (QM) methods are well kn...

متن کامل

Computer Simulation Codes for the Quine-McCluskey Method of Logic Minimization

The Quine-McCluskey method is useful in minimizing logic expressions for larger number of variables when compared with minimization by Karnaugh Map or Boolean algebra. In this paper, we have tried to put together all of the computer codes which are available on the internet, edited and modified them as well as rewritten some parts of those collected codes our self, which are used in the impleme...

متن کامل

Total 6 Exact Hazard-free Logic Minimization. 4 Conditions for a Hazard-free Transition. Exact Two-level Minimization of Hazard-free Logic with Multiple-input Changes 3

This paper describes a new method for exact hazard-free logic minimization of Boolean functions. Given an incompletelyspecified Boolean function, the method produces a minimal sumof-products implementation which is hazard-free for a given set of multiple-input changes, if such a solution exists. The method is a constrained version of the Quine-McCluskey algorithm. It has been automated and appl...

متن کامل

Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method

Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not g...

متن کامل

A New Case for Image Compression Using Logic Function Minimization

Sum of minterms is a canonical form for representing logic functions. There are classical methods such as Karnaugh map or Quine–McCluskey tabulation for minimizing a sum of products. This minimization reduces the minterms to smaller products called implicants. If minterms are represented by bit strings, the bit strings shrink through the minimization process. This can be considered as a kind of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1410.1059  شماره 

صفحات  -

تاریخ انتشار 2014